The graph bisection minimization problem
نویسنده
چکیده
A method of determining a lower bound for the graph bisection minimization problem is described. The bound is valid for weigthed graphs with edge and node weights. The approach is based on Lagrangian relaxation and was previously used for determining an upper bound on the independence number of a graph. The determination of the lower bound is done by solving a quadratic programming problem. A characterization of the solutions of this problem is proved which allows to approximate the optimal solution of the graph bisection minimization problem. Some computational experiments are reported.
منابع مشابه
SDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملNew Spectral Lower Bounds on the Bisection Width of Graphs
The communication overhead is a major bottleneck for the execution of a process graph on a parallel computer system. In the case of two processors, the minimization of the communication can be modeled by the graph bisection problem. The spectral lower bound of 2jV j 4 for the bisection width of a graph is well-known. The bisection width is equal to 2jV j 4 iff all vertices are incident to 2 2 c...
متن کاملOrienteering Problem with Variable Profits, Fractional Objective Function and Demand on Arcs
Nowadays, due to the high expectations of customers in meeting their demand and the competition environment among service providers, employers are working to provide customers with new methods in the shortest possible time and in the best possible way to attract customer’s satisfaction and maximize profits. In this paper, the orienteering problem with variable profits, fractional objective func...
متن کاملA Multidimensional Bisection Method for Unconstrained Minimization Problem
An extension of a new multidimensional bisection method for minimizing function over simplex is proposed for solving nonlinear unconstrained minimization problem. The method does not require a differentiability of function, and is guaranteed to converge to the minimizer for the class of strictly unimodal functions. The computational results demonstrating an effectiveness of algorithm for minimi...
متن کاملA particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003